Search results for " Program"

showing 10 items of 3075 documents

Semantics of UML 2.0 Activity Diagram for Business Modeling by Means of Virtual Machine

2005

The paper proposes a more formalized definition of UML 2.0 Activity Diagram semantics. A subset of activity diagram constructs relevant for business process modeling is considered. The semantics definition is based on the original token flow methodology, but a more constructive approach is used. The Activity Diagram Virtual machine is defined by means of a metamodel, with operations defined by a mix of pseudocode and OCL pre- and postconditions. A formal procedure is described which builds the virtual machine for any activity diagram. The relatively complicated original token movement rules in control nodes and edges are combined into paths from an action to action. A new approach is the us…

FOS: Computer and information sciencesComputer Science - Programming LanguagesSemantics (computer science)Computer scienceProgramming languageActivity diagramBusiness process modelingSecurity tokencomputer.software_genreMetamodelingComputational Engineering Finance and Science (cs.CE)Unified Modeling LanguageVirtual machineComputer Science - Computational Engineering Finance and SciencePseudocodecomputercomputer.programming_languageProgramming Languages (cs.PL)
researchProduct

Saying Hello World with MOLA - A Solution to the TTC 2011 Instructive Case

2011

This paper describes the solution of Hello World transformations in MOLA transformation language. Transformations implementing the task are relatively straightforward and easily inferable from the task specification. The required additional steps related to model import and export are also described.

FOS: Computer and information sciencesComputer Science - Programming LanguagesbiologyComputer scienceProgramming languagelcsh:Mathematicsbiology.organism_classificationcomputer.software_genrelcsh:QA1-939Transformation languagelcsh:QA75.5-76.95Task (project management)Software Engineering (cs.SE)Computer Science - Software EngineeringMolaInstructive caselcsh:Electronic computers. Computer sciencecomputerProgramming Languages (cs.PL)Electronic Proceedings in Theoretical Computer Science
researchProduct

Improving table compression with combinatorial optimization

2002

We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [SODA'00], in which a table is partitioned by an off-line training procedure into disjoint intervals of columns, each of which is compressed separately by a standard, on-line compressor like gzip. We provide a new theory that unifies previous experimental observations on partitioning and heuristic observations on column permutation, all of which are used to improve compression rates. Based on the theory, we devise the first on-line training algorithms for table compression, which can be applied to individual files, not just continuously operating sources; and also a new, …

FOS: Computer and information sciencesComputer scienceHeuristic (computer science)E.4G.2.1Data_CODINGANDINFORMATIONTHEORYDisjoint setsTravelling salesman problemPermutationArtificial IntelligenceCompression (functional analysis)Computer Science - Data Structures and AlgorithmsH.1.8H.2.7Data Structures and Algorithms (cs.DS)E.4; F.1.3; F.2.2; G.2.1; H.1.1; H.1.8; H.2.7H.1.1Dynamic programmingHardware and ArchitectureControl and Systems EngineeringCombinatorial optimizationTable (database)F.1.3F.2.2AlgorithmSoftwareInformation SystemsJournal of the ACM
researchProduct

Separations in Query Complexity Based on Pointer Functions

2015

In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function $f$ on $n=2^k$ bits defined by a complete binary tree of NAND gates of depth $k$, which achieves $R_0(f) = O(D(f)^{0.7537\ldots})$. We show this is false by giving an example of a total boolean function $f$ on $n$ bits whose deterministic query complexity is $\Omega(n/\log(n))$ while its zero-error randomized query complexity is $\tilde O(\sqrt{n})$. We further show that the quantum query complexity of the same function is $\tilde O(n^{1/4})$, giving the first example of a total function with a super-quadra…

FOS: Computer and information sciencesFOS: Physical sciences0102 computer and information sciencesComputational Complexity (cs.CC)01 natural sciencesCombinatoricsArtificial Intelligence0103 physical sciences0101 mathematics010306 general physicsCommunication complexityBoolean functionQuantumMathematicsDiscrete mathematicsQuantum PhysicsBinary tree010102 general mathematicsNAND logicRandomized algorithmComputer Science - Computational ComplexityHardware and ArchitectureControl and Systems Engineering010201 computation theory & mathematicsIndependent setPointer (computer programming)Quantum algorithmQuantum Physics (quant-ph)SoftwareInformation Systems
researchProduct

An LP-based hyperparameter optimization model for language modeling

2018

In order to find hyperparameters for a machine learning model, algorithms such as grid search or random search are used over the space of possible values of the models hyperparameters. These search algorithms opt the solution that minimizes a specific cost function. In language models, perplexity is one of the most popular cost functions. In this study, we propose a fractional nonlinear programming model that finds the optimal perplexity value. The special structure of the model allows us to approximate it by a linear programming model that can be solved using the well-known simplex algorithm. To the best of our knowledge, this is the first attempt to use optimization techniques to find per…

FOS: Computer and information sciencesMathematical optimizationPerplexityLinear programmingComputer scienceMachine Learning (stat.ML)02 engineering and technology010501 environmental sciences01 natural sciencesTheoretical Computer ScienceNonlinear programmingMachine Learning (cs.LG)Random searchSimplex algorithmSearch algorithmStatistics - Machine Learning0202 electrical engineering electronic engineering information engineeringFOS: MathematicsMathematics - Optimization and Control0105 earth and related environmental sciencesHyperparameterComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science - LearningHardware and ArchitectureOptimization and Control (math.OC)Hyperparameter optimization020201 artificial intelligence & image processingLanguage modelSoftwareInformation Systems
researchProduct

Supervised Quantum Learning without Measurements

2017

We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation that introduces feedback in the dynamics and eliminates the necessity of intermediate measurements. The performance of the quantum algorithm is analyzed by comparing the results obtained in numerical simulations with the outcome of classical machine learning methods for the same problem. The use of time-delayed equations enhances the toolbox of the field of quantum machine learning, which may enable unprecedented applications in quantum technologies. The…

FOS: Computer and information sciencesQuantum machine learningField (physics)Computer Science - Artificial IntelligenceComputer sciencelcsh:MedicineFOS: Physical sciencesMachine Learning (stat.ML)01 natural sciencesUnitary stateArticle010305 fluids & plasmasSuperconductivity (cond-mat.supr-con)Statistics - Machine Learning0103 physical sciencesMesoscale and Nanoscale Physics (cond-mat.mes-hall)lcsh:Science010306 general physicsQuantumProtocol (object-oriented programming)Quantum PhysicsClass (computer programming)MultidisciplinaryCondensed Matter - Mesoscale and Nanoscale PhysicsCondensed Matter - Superconductivitylcsh:RQuantum technologyArtificial Intelligence (cs.AI)ComputerSystemsOrganization_MISCELLANEOUSlcsh:QQuantum algorithmQuantum Physics (quant-ph)Algorithm
researchProduct

Random Interruptions in Cooperation for Spectrum Sensing in Cognitive Radio Networks

2015

In this paper, a new cooperation structure for spectrum sensing in cognitive radio networks is proposed which outperforms the existing commonly-used ones in terms of energy efficiency. The efficiency is achieved in the proposed design by introducing random interruptions in the cooperation process between the sensing nodes and the fusion center, along with a compensation process at the fusion center. Regarding the hypothesis testing problem concerned, first, the proposed system behavior is thoroughly analyzed and its associated likelihood-ratio test (LRT) is provided. Next, based on a general linear fusion rule, statistics of the global test summary are derived and the sensing quality is cha…

FOS: Computer and information sciencesSemidefinite programmingMathematical optimizationta213Computer scienceInformation Theory (cs.IT)Computer Science - Information Theory010401 analytical chemistrydecision/data fusion020206 networking & telecommunications02 engineering and technology01 natural sciencesStatistical power0104 chemical sciencescooperative spectrum sensingCognitive radionon-ideal reporting channelsefficiency0202 electrical engineering electronic engineering information engineeringcognitive radio (CR)False alarmElectrical and Electronic EngineeringStatistical hypothesis testingEfficient energy use
researchProduct

Hyaluronic acid-based two-stage medical therapy to unfold the aged face: The centrifugal approach

2020

Background: Facial aging is a multifactorial process characterized by structural changes to the dermis and ligaments, lipoatrophy in the fat pads and hypodermis, remodeling of the bony skeleton, change in muscle tonicity and tissue descent. Aims: The purpose of this study is to evaluate the efficacy of a hyaluronic acid-based treatment for the aging face that addresses all its causes in a caudal to cranial and medial to lateral direction: the centrifugal technique. Methods: Between March 2015 and January 2018, 187 patients were treated with a high G’ hyaluronic acid in two sessions, one/two weeks apart, to improve signs of facial aging, starting from the lower centrofacial area and progress…

Facial rejuvenationSettore MED/19 - Chirurgia PlasticaDentistryCosmetic TechniquesDermatology030207 dermatology & venereal diseases03 medical and health scienceschemistry.chemical_compound0302 clinical medicineDermisfacial rejuvenationHyaluronic acidhyaluronic acidHumansRejuvenationMedicineStage (cooking)LipoatrophyAgedmidface agingbusiness.industrymedicine.diseaseSkeleton (computer programming)Nasolabial foldSkin AgingTreatment Outcomemedicine.anatomical_structurechemistryPatient Satisfaction030220 oncology & carcinogenesisnasolabial foldbusinessMedical therapy
researchProduct

Using the factorial experiment method to analyze the corrosion protection process

2017

The organization functions are: research-development, production, commercial, financial-accounting, personnel and quality. In this paper the factorial experimental method will be applied, which is currently one of the most widespread methods used in the research-development departments of the organizations, due to its advantages and efficiency. The experiment was carried out at SC Coifer Impex SRL-Mirsa’s metal structures factory. In this paper it is presented the factors modelling that exerts their influence on two objectives functions: the ensuring the nominal thickness of the rough-cast film and the consumption limiting. For data processing the STATISTICA 7 software was used which provid…

FactorialEngineeringData processingbusiness.industryProcess (engineering)media_common.quotation_subjectMechanical engineeringFactorial experimentNominal sizeSoftwarelcsh:TA1-2040Factory (object-oriented programming)Quality (business)Process engineeringbusinesslcsh:Engineering (General). Civil engineering (General)media_commonMATEC Web of Conferences
researchProduct

Fair Pairwise Learning to Rank

2020

Ranking algorithms based on Neural Networks have been a topic of recent research. Ranking is employed in everyday applications like product recommendations, search results, or even in finding good candidates for hiring. However, Neural Networks are mostly opaque tools, and it is hard to evaluate why a specific candidate, for instance, was not considered. Therefore, for neural-based ranking methods to be trustworthy, it is crucial to guarantee that the outcome is fair and that the decisions are not discriminating people according to sensitive attributes such as gender, sexual orientation, or ethnicity.In this work we present a family of fair pairwise learning to rank approaches based on Neur…

FairnessArtificial neural networkNeural Networksbusiness.industryComputer science05 social sciencesRank (computer programming)02 engineering and technologyMachine learningcomputer.software_genreFairness Neural Networks RankingOutcome (game theory)Ranking (information retrieval)Correlation020204 information systems0202 electrical engineering electronic engineering information engineeringRelevance (information retrieval)Learning to rankProduct (category theory)Artificial intelligenceRanking0509 other social sciences050904 information & library sciencesbusinesscomputer
researchProduct