Abstract: Program analyses frequently track objects throughout a program, which requires reasoning about aliases. Most dataflow analysis frameworks, however, delegate the task of handling aliases to the analysis clients, which causes a number of problems. For instance, custom-made extensions for alias analysis are complex and cannot easily be reused. On the other hand, due to the complex interfaces involved, off-the-shelf alias analyses are hard to integrate precisely into clients. Lastly, for precision many clients require strong updates, and alias abstractions supporting strong updates are often relatively inefficient. In this paper, we present IDEal, an alias-aware extension to the framework for Interprocedural Distributive Environment (IDE) problems. IDEal relieves static-analysis authors completely of the burden of handling aliases by automatically resolving alias queries on-demand, both efficiently and precisely. IDEal supports a highly precise analysis using strong updates by resorting to an on-demand, flow-sensitive, and context-sensitive all-alias analysis. Yet, it achieves previously unseen efficiency by propagating aliases individually, creating highly reusable per-pointer summaries. We empirically evaluate IDEal by comparing TSf, a state-of-the-art typestate analysis, to TSal, an IDEal-based typestate analysis. Our experiments show that the individual propagation of aliases within IDEal enables TSal to propagate 10.4x fewer dataflow facts and analyze 10.3x fewer methods when compared to TSf. On the DaCapo benchmark suite, TSal is able to efficiently compute precise results.

Abstract: Database Management Systems (DBMSs) provide access control mechanisms that allow database administrators (DBAs) to grant application programs access privileges to databases. Though such mechanisms are powerful, in practice finer-grained access control mechanism tailored to the semantics of the data stored in the DMBS is required as a first class defense mechanism against smart attackers. Hence, custom written applications which access databases implement an additional layer of access control. Therefore, securing a database alone is not enough for such applications, as attackers aiming at stealing data can take advantage of vulnerabilities in the privileged applications and make these applications to issue malicious database queries. An access control mechanism can only prevent application programs from accessing the data to which the programs are not authorized, but it is unable to prevent misuse of the data to which application programs are authorized for access. Hence, we need a mechanism able to detect malicious behavior resulting from previously authorized applications. In this paper, we present the architecture of an anomaly detection mechanism, DetAnom , that aims to solve such problem. Our approach is based the analysis and profiling of the application in order to create a succinct representation of its interaction with the database. Such a profile keeps a signature for every submitted query and also the corresponding constraints that the application program must satisfy to submit the query. Later, in the detection phase, whenever the application issues a query, a module captures the query before it reaches the database and verifies the corresponding signature and constraints against the current context of the application. If there is a mismatch, the query is marked as anomalous. The main advantage of our anomaly detection mechanism is that, in order to build the application profiles, we need neither any previous knowledge of application vulnerabilities nor any example of possible attacks. As a result, our mechanism is able to protect the data from attacks tailored to database applications such as code modification attacks, SQL injections, and also from other data-centric attacks as well. We have implemented our mechanism with a software testing technique called concolic testing and the PostgreSQL DBMS. Experimental results show that our profiling technique is close to accurate, requires acceptable amount of time, and the detection mechanism incurs low runtime overhead.

Abstract: This paper presents a simple method to improve the alias rejection in comb decimation filters. The method is based on a mathematical result regarding zeros of palindromic polynomials of even degree. Using this result, additional zeros are introduced in comb folding bands (bands around the comb zeros), resulting in an improved alias rejection. Like a comb filter, the proposed decimation filter is also multiplierless. The comparisons with some recent methods for comb alias rejection improvements with a similar complexity are also provided.

Abstract: Since the early 2000's, the Internet Topology has been frequently described and modeled from the perspective of routers. To this end, alias resolution mechanisms have been developed in order to aggregate all IP interfaces of a router, collected with traceroute, into a single identifier. So far, many active measurement techniques have been considered, often taking advantage of specific features from network protocols. However, a lot of these methods have seen their efficiency decrease over time due to security reinforcements across the Internet. In this paper, we introduce a generic methodology to conduct efficient and scalable alias resolution. It combines the space search reduction of TreeNET (a tool for efficiently discovering subnets) with a fingerprinting process used to assess the feasibility of several state-of-the-art alias resolution methods, using a small, fixed amount of probes. We validate our method along MIDAR on an academic groundtruth and demonstrate that our methodology can achieve similar accuracy while using less probes and discovering subnets in the process. We further evaluate our method with measurements made on PlanetLab towards several distinct ASes of varying sizes and roles in the Internet. The collected data shows that some properties of our fingerprints correlate with each other, hinting some observed profiles could be linked with equipment vendors. Both TreeNET (which implements our methodology) and our dataset are freely available.

Abstract: A new asynchronous early output section-carry based carry lookahead adder (SCBCLA) with alias carry output logic is presented in this paper. To evaluate the proposed SCBCLA with alias carry logic and to make a comparison with other CLAs, a 32-bit addition operation is considered. Compared to the weak-indication SCBCLA with alias logic, the proposed early output SCBCLA with alias logic reports a 13% reduction in area without any increases in latency and power dissipation. On the other hand, in comparison with the early output recursive CLA (RCLA), the proposed early output SCBCLA with alias logic reports a 16% reduction in latency while occupying almost the same area and dissipating almost the same average power. All the asynchronous CLAs are quasi-delay-insensitive designs which incorporate the delay-insensitive dual-rail data encoding and adhere to the 4-phase return-to-zero handshaking. The adders were realized and the simulations were performed based on a 32/28nm CMOS process.

Abstract: Precise analysis of pointer information plays an important role in many static analysis tools. The precision, however, must be balanced against the scalability of the analysis. This paper focusses on improving the precision of standard context and flow insensitive alias analysis algorithms at a low scalability cost. In particular, we present a semantics-preserving program transformation that drastically improves the precision of existing analyses when deciding if a pointer can alias Null. Our program transformation is based on Global Value Numbering, a scheme inspired from compiler optimization literature. It allows even a flow-insensitive analysis to make use of branch conditions such as checking if a pointer is Null and gain precision. We perform experiments on real-world code and show that the transformation improves precision (in terms of the number of dereferences proved safe) from 86.56% to 98.05%, while incurring a small overhead in the running time.

Abstract: A new asynchronous early output section-carry based carry lookahead adder (SCBCLA) with alias carry output logic is presented in this paper. To evaluate the proposed SCBCLA with alias carry logic and to make a comparison with other CLAs, a 32-bit addition operation is considered. Compared to the weak-indication SCBCLA with alias logic, the proposed early output SCBCLA with alias logic reports a 13% reduction in area without any increases in latency and power dissipation. On the other hand, in comparison with the early output recursive CLA (RCLA), the proposed early output SCBCLA with alias logic reports a 16% reduction in latency while occupying almost the same area and dissipating almost the same average power. All the asynchronous CLAs are quasi-delay-insensitive designs which incorporate the delay-insensitive dual-rail data encoding and adhere to the 4-phase return-to-zero handshaking. The adders were realized and the simulations were performed based on a 32/28nm CMOS process.

Abstract: Method and apparatus for managing data in a distributed data storage system. In some embodiments, a plurality of storage devices define an overall available memory space. A control circuit stores a first copy of user data from a selected distributed data set in a working set of memory buffers, stores a duplicate, second copy of the user data in an alias set of memory buffers, generates parity data based on the second copy of the user data in the alias set of the memory buffers, and flushes the user data and the parity data from the alias set of memory buffers to the storage devices while the first copy of the user data remains in the working set of the memory buffers. In this way, subsequently received access commands can be serviced using the working set of the memory buffers.

Abstract: The invention is a discovering and linking method of knowledge graph entity based on production alias excavation, which comprises the following steps that A: the entity is alias excavated and then an alias-entity mapping dictionary is produced; B: a candidate entity is produced based on the improved text edit distance; and C: the candidate entity is distinguished to attain an entity alleged item

Abstract: Deployment and maintenance of current data center networks is costly and prone to errors. In order to avoid manual configuration, many of them require centralized administrators which constitute a clear bottleneck, while distributed approaches do not guarantee sufficient flexibility or robustness. This paper describes and evaluates GA3 (Generalized Automatic Address Assignment), a discovery protocol that assigns multiple unique labels to all the switches in a hierarchical network, without any modification of hosts or the standard Ethernet frames. Labeling is distributed and uses probes. These labels can be leveraged for shortest path routing without tables, as in the case of the Torii protocol, but GA3 also allows other label-based routing protocols (such as PortLand or ALIAS). Additionally, GA3 can detect miswirings in the network. Furthermore, control traffic is only necessary upon network deployment rather than periodically. Simulation results showed a reduced convergence time of less than 2 s and 100 kB/s of bandwidth (to send the GA3 frames) in the worst case for popular data center topologies, which outperforms other similar protocols.

Abstract: Precise analysis of pointer information plays an important role in many static analysis techniques and tools today. The precision, however, must be balanced against the scalability of the analysis. This paper focusses on improving the precision of standard context and flow insensitive alias analysis algorithms at a low scalability cost. In particular, we present a semantics-preserving program transformation that drastically improves the precision of existing analyses when deciding if a pointer can alias NULL. Our program transformation is based on Global Value Numbering, a scheme inspired from compiler optimizations literature. It allows even a flow-insensitive analysis to make use of branch conditions such as checking if a pointer is NULL and gain precision. We perform experiments on real-world code to measure the overhead in performing the transformation and the improvement in the precision of the analysis. We show that the precision improves from 86.56% to 98.05%, while the overhead is insignificant.

Abstract: Type-based alias analyses allow C compilers to infer that memory locations of distinct types do not alias. Idiomatic reliance on pointers on the one hand, and separate compilation on the other hand, together make it impossible to get this aliasing information any other way. As a consequence, most modern optimizing C compilers implement some sort of type-based alias analysis. Unfortunately, pointer conversions, another pervasive idiom to achieve code reuse in C, can interact badly with type-based alias analyses. This article investigate the fine line between the allowable uses of low-level constructs (pointer conversions, unions) that should never cause the predictions of a standard-compliant type-based alias analysis to be wrong, and the dangerous uses that can result in bugs in the generated binary. A sound and precise analyzer for “strict aliasing” violations is briefly described.

Abstract: Genome-analysis enables researchers to detect mutations within genomes and deduce their consequences. Researchers need reliable analysis platforms to ensure reproducible and comprehensive analysis results. Database systems provide vital support to implement the required sustainable procedures. Nevertheless, they are not used throughout the complete genome-analysis process, because (1) database systems suffer from high storage overhead for genome data and (2) they introduce overhead during domain-specific analysis. To overcome these limitations, we integrate genome-specific compression into database systems using a specialized database schema. Thus, we can reduce the storage consumption of a database approach by up to 35%. Moreover, we exploit genome-data characteristics during query processing allowing us to analyze real-world data sets up to five times faster than specialized analysis tools and eight times faster than a straightforward database approach.

Abstract: This paper presents new models that automatically align online aliases with their real entity names. Many research applications rely on identifying entity names in text, but people often refer to entities with unexpected nicknames and aliases. For example, The King and King James are aliases for Lebron James, a professional basketball player. Recent work on entity linking attempts to resolve mentions to knowledge base entries, like a wikipedia page, but linking is unfortunately limited to well-known entities with pre-built pages. This paper asks a more basic question: can aliases be aligned without background knowledge of the entity? Further, can the semantics surrounding alias mentions be used to inform alignments? We describe statistical models that make decisions based on the lexicographic properties of the aliases with their semantic context in a large corpus of tweets. We experiment on a database of Twitter users and their usernames, and present the first human evaluation for this task. Alignment accuracy approaches human performance at 81%, and we show that while lexicographic features are most important, the semantic context of an alias further improves classification accuracy.

Abstract: The invention discloses a processing method and device of medical business data, and is applied to the processing system of the medical business data. The system comprises a plurality of subsystems and an information platform. The processing method comprises the following steps of: obtaining a subsystem data access request, and obtaining a SQL (Structured Query Language) statement corresponding to each subsystem; calling the SQL statement to operate the database of the subsystem, and obtaining a result table, wherein the result table comprises a table property alias and a table property value; according to a mapping relationship between the table property alias and a corresponding anode property in a preset message template, obtaining the corresponding node property in the preset message template; and according to the node property, obtaining the corresponding table property value from the result table, and packaging the table property value in the preset message template so as to generate and store a message data example. By use of the processing method, message data transmission efficiency among all medical subsystems is greatly improved, meanwhile, access time is saved for users, and system operation efficiency is improved.

Abstract: This paper presents alias rejection improvement in a two-stage cosine filter-based two-stage structure for even decimation factors, a structure recently proposed in literature. The structure improves alias rejection in all odd comb folding bands by introducing simple modified cosine filter at the second stage. The goal here is to improve the aliasing rejection in even folding bands, while keeping a low complexity of the structure. This is achieved by introducing simple expanded cosine filter at the first stage, and increase by one the number of the cascaded combs at the first stage. The resulting filter is multiplierless and has an improved alias rejection in all folding bands in comparison with the original structure. The mathematical background of the method is presented. The method is illustrated with an example and it is compared with some recently proposed methods for aliasing rejection improvement. The efficient structures are also presented.

Abstract: Provided are a computer program product, system, and method for sharing alias addresses among logical devices by a host accessing logical devices provisioned with a capacity from physical devices managed by a control unit. The host establishes with the control unit an association of logical devices and alias addresses assigned to the logical devices, wherein the alias addresses are associated with an alias management group. Alias address pool information is generated indicating each of the logical devices and their assigned alias addresses indicated in the association. The host uses from the alias address pool information any one of the alias addresses in the alias address pool information to access any of the logical devices associated with the same alias management group as the alias address.

Abstract: In certain fields, real-time knowledge from events can help in making informed decisions. In order to extract pertinent real-time knowledge related to an event, it is important to identify the named entities and their corresponding aliases related to the event. The problem of identifying aliases of named entities that spike has remained unexplored. In this paper, we introduce an algorithm, EntitySpike, that identifies entities that spike in popularity in tweets from a given time period, and constructs an alias list for these spiked entities. EntitySpike uses a temporal heuristic to identify named entities with similar context that occur in the same time period (within minutes) during an event. Each entity is encoded as a vector using this temporal heuristic. We show how these entity-vectors can be used to create a named entity alias list. We evaluated our algorithm on a dataset of temporally ordered tweets from a single event, the 2013 Grammy Awards show. We carried out various experiments on tweets that were published in the same time period and show that our algorithm identifies most entity name aliases and outperforms a competitive baseline.

Abstract: With the popularity of social networks, such as mi-croblogs and Twitter, topic inference for short text is increasingly significant and essential for many content analysis tasks. Biterm topic model (BTM) is superior to conventional topic models in uncovering latent semantic relevance for short text. However, Gibbs sampling employed by BTM is very time consuming when inferring topics, especially for large-scale datasets. It requires O{K) operations per sample for K topics, where K denotes the number of topics in the corpus. In this paper, we propose an acceleration algorithm of BTM, FastBTM, using an efficient sampling method for BTM which only requires O(1) amortized time while the traditional ones scale linearly with the number of topics. FastBTM is based on Metropolis-Hastings and alias method, both of which have been widely adopted in latent Dirichlet allocation (LDA) model and achieved outstanding speedup. We carry out a number of experiments on Tweets2011 Collection dataset and Enron dataset, indicating that our method is robust enough for both short texts and normal documents. Our work can be approximately 9 times faster than traditional Gibbs sampling method per iteration, when setting K = 1000. The source code of FastBTM can be obtained from https://github.com/paperstudy/FastBTM.

Abstract: Intelligent assistant systems, methods and computing devices are disclosed for resolving alias identifiers. A method comprises receiving and parsing data comprising a current user input that includes an alias identifier. The data and/or other sensor data are analyzed to identify the user. Based at least on identifying the user and recognizing the alias identifier, usage pattern data comprising at least one previous user input that includes the alias identifier and corresponding context information is accessed. The usage pattern data is used to resolve the alias identifier to mean the alias identifier in an alias record of a known entity. Based at least on resolving the alias identifier, an output device is controlled to one or more of generate a message and perform an action with respect to the known entity.

Abstract: A medical scan report labeling system is operable to transmit a medical report that includes natural language text to a first client device for display. Identified medical condition term data is received from the first client device in response. An alias mapping pair in a medical label alias database is identified by determining that a medical condition term of the alias mapping pair compares favorably to the identified medical condition term data. A medical code that corresponds to the alias mapping pair and a medical scan that corresponds to the medical report are transmitted to a second client device of an expert user for display, and accuracy data is received from the second client device in response. The medical code is mapped to the first medical scan in the medical scan database when the accuracy data indicates that the medical code compares favorably to the medical scan.

Abstract: Aspects of the disclosure are directed to an apparatus including a scale and external circuitry The scale collects signals from a plurality of users and associates the respective collected signals with a user among the plurality The scale further verifies a biometric using the collected signals and a user profile corresponding to the user, removes portions of user data that identifies the user, adds an identifier to the user data indicative of an identity of the scale and the user, and outputs at least a portion of the user data to external circuitry The external circuitry receives the user data, replaces the identifier with an alias ID, and stores the user data with the alias ID in a first database and identification of which scale and user that corresponds to the alias ID in a second database

Abstract: A system comprises an analog front end (AFE), an analog-to-digital converter (ADC), and alias detection circuitry. The AFE may be operable to receive an analog signal via a communication medium, wherein a first frequency band of the analog signal is occupied by an OFDM symbol and a second frequency band of the analog signal is occupied by first aliases generated during digital-to-analog conversion of the OFDM symbol. The ADC is operable to digitize the particular band of the analog signal to generate a digital signal, wherein, during the digitization, aliasing of the first aliases results in second aliases which fall into the first frequency band. The alias detection circuitry is operable to detect the second aliases in the first frequency band of the digital signal, and process the digital signal based on the detected second aliases to generate an output signal.

Abstract: As most database users cannot precisely express their information needs in the form of database queries, it is challenging for database query interfaces to understand and satisfy their intents. Database systems usually improve their understanding of users' intents by collecting their feedback on the answers to the users' imprecise and ill-specified queries. Users may also learn to express their queries precisely during their interactions with the database system. In this paper, we report our progress on developing a formal framework for representing and understanding information needs in database querying and exploration. Our framework considers querying as a collaboration between the user and the database system to establish a mutual language for representing information needs. We formalize this collaboration as a signaling game between two potentially rational agents: the user and the database system. We believe that this framework naturally models the long-term interaction of users and database systems.

Abstract: The present invention discloses a bitcoin wallet supporting a bitcoin address alias and a bitcoin wallet payment method supporting the bitcoin address alias The bitcoin wallet supporting the bitcoin address alias is characterized by comprising an alias input module used for defining an alias for a bitcoin address, sending the alias and the corresponding bitcoin address to an alias transaction creating and sending module; the alias transaction creating and sending module used for creating an alias transaction, sending the alias transaction to a block chain system, and finally writing in a block chain; a payment module used for sending the inputted bitcoin address of a payee to an alias query module when paying the bitcoins; the alias query module used for querying the alias corresponding to the bitcoin address of the payee automatically in the block chain system, and feeding back the alias to the payment module The bitcoin wallet supporting the bitcoin address alias and the bitcoin wallet payment method supporting the bitcoin address alias can help users to confirm whether the inputted bitcoin address is right, are used for the bitcoin wallet, and are also used for the wallet clients of the other block chain systems

Abstract: This article introduced the Alias of automotive rearview mirror A level surface design content. Also explains the concept of A level surface characteristics, analyzed the meet class A surface design method of modeling steps and auto rearview mirror. Modeling scheme decision, according to three view drawing for drawing wire, physical photo, the Bezier curve, the Bezier surface requirement, choose the right solution, then, based on A level surface quality evaluation standards choose detection schemes for the class A surface. Introduction. The CAS surface refers to the surface with high quality, the high quality of the surface is suitable in the visual, wrinkle-free and discontinuous without reason. CAS surface in math is refers to the various points between the surface curvature radius of jumping is smaller than a certain value numerical grade and G2 continuity of the curved surface. Modelling the early stage of the design using CAS surface design department. Play a very important role for decision making and originality, CAS surface design for automotive appearance modelling style, outline of overall modelling, the proportion of car interiors and exteriors, the characteristics of automobile waist line, etc., is crucial. Automobile modeling change phase to the modelling of relevant rules and regulations, automobile design, related to engineering, the whole production manufacturing and after-sale maintenance, insurance service of checking and different proportion of automobile simulation model of sludge production, are generally by CAS surface design to assist to complete the design. We say A level Surface, it is then the CAS (Class A Surface) the design of the Surface, into the final used in industrial production and can meet all kinds of auto safety rules and regulations, and very precise, high quality and continuity of the curved Surface design data. A level surface is extremely important concept car design field. General requirements for G2 continuity, too small for G1 continuous fillet. A Level Surface Conditions to be Met. A level surface for Degree and Span has strict requirements, Alias highest order for 9 order, not more than 7 order strictly, Span number is 1; For A single A surface, in UV each boundary direction to ensure consistency of curvature and ductibility, CV point distribution uniformity of change; A surface between continuous, requires at least meet tangential curvature; Surface fairing degrees, with intuitive performance should be combined with the Alias high detection, zebra crossing is checked, the Curvature color Evaluation "Curvature Evaluation" to come into the tools for Evaluation, and should not appear distorted, mutations in the inflexion of flaws. 776 7th International Conference on Education, Management, Computer and Society (EMCS 2017) Advances in Computer Science Research (ACSR), volume 61

Abstract: Systems, computer program products, and methods are described herein for transfer of resources via a secure channel using an alias The present invention receives a first alias associated with a user; dynamically generates a web portal associated with the entity to enable the user to input an authorization code; electronically receives, via the web portal, the authorization code from the user; determine a first resource event based on at least receiving the first alias and the authorization code; triggers the first resource event based on at least a successful validation of the authorization code; and transfers the resources from the user record associated with the third party to the target record via the secure channel in response to triggering the first resource event

Abstract: According to one embodiment of the invention, a method for determining a personal identifier corresponding to an alias is provided. The method comprises receiving a request to provide a resource, the resource being provided from an originating party to an alias representing a receiving party. The method further comprises transmitting an inquiry for a personal identifier corresponding to the alias to a plurality of remote computers, interacting with the plurality of remote computers to provide the personal identifier corresponding to the alias, and selecting a remote computer from the plurality of remote computers using selection criteria. The method further comprises requesting the personal identifier from the selected remote computer, and receiving the personal identifier from the remote computer.